Cluster pinch-point densities in polygons
نویسندگان
چکیده
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملCLUSTER CATEGORIES, m-CLUSTER CATEGORIES AND DIAGONALS IN POLYGONS
The goals of this expository article are on one hand to describe how to construct (m-) cluster categories from triangulations (resp. from m+2angulations) of polygons. On the other hand, we explain how to use translation quivers and their powers to obtain the m-cluster categories directly from the diagonals of a polygon.
متن کاملOn polygons enclosing point sets
Let R and B be disjoint point sets such that R ∪ B is in general position. We say that B is enclosed by R if there is a simple polygon P with vertex set R such that all the elements in B belong to the interior of P . In this paper we prove that if the vertices of the convex hull of R ∪B belong to B, and |R| ≤ |Conv(R)| − 1 then B encloses R. The bound is tight. This improves on results of a pre...
متن کاملOn polygons excluding point sets
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that B ∪ R is in general position, and the convex hull of B contains k interior blue points and l interior red points. Hurtado et al. found sufficient conditions for the existence of a blue polygo...
متن کاملRobust Point Location in Approximate Polygons
This paper presents a framework for reasoning about robust geoemtric algorithms. Robustness is formally deened and a data structure called an approximate polygon is introduced and used to reason about polygons constructed of edges whose positions are uncertain. A robust algorithm for point location in an approximate polygon is presented. The algorithm uses only the signature of the point (not i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2012
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/45/50/505002